Semantics and Algorithms for Parametric Monitoring

Analysis of execution traces plays a fundamental role in many program analysis approaches, such as runtime verification, testing, monitoring, and specification mining. Execution traces are frequently parametric, i.e., they contain events with parameter bindings. Each parametric trace usually consists of many meaningful trace slices merged together, each slice corresponding to one parameter binding. For example, a Java program creating iterator objects i1 and i2 over collection object c1 may yield a trace createIter〈c1 i1〉 next〈i1〉 createIter〈c1 i2〉 updateColl〈c1〉 next〈i1〉 parametric in collection c and iterator i, whose slices corresponding to instances “c, i 7→ c1, i1” and “c, i 7→ c1, i2” are createIter〈c1 i1〉 next〈i1〉 updateColl〈c1〉 next〈i1〉 and, respectively, createIter〈c1 i2〉 updateColl〈c1〉. Several approaches have been proposed to specify and dynamically analyze parametric properties, but they have limitations: some in the specification formalism, others in the type of trace they support. Not unexpectedly, the existing approaches share common notions, intuitions, and even techniques and algorithms, suggesting that a fundamental study and understanding of parametric trace analysis is necessary. This foundational paper aims at giving a semantics-based solution to parametric trace analysis that is unrestricted by the type of parametric property or trace that can be analyzed. Our approach is based on a rigorous understanding of what a parametric trace/property/monitor is and how it relates to its non-parametric counter-part. A generalpurpose parametric trace slicing technique is introduced, which takes each event in the parametric trace and dispatches it to its corresponding trace slices. This parametric trace slicing technique can be used in combination with any conventional, non-parametric trace analysis technique, by applying the later on each trace slice. As an instance, a parametric property monitoring technique is then presented, which processes each trace slice online. Thanks to the generality of parametric trace slicing, the parametric property monitoring technique reduces to encapsulating and indexing unrestricted and well-understood nonparametric property monitors (e.g., finite or push-down automata). The presented parametric trace slicing and monitoring techniques have been implemented and extensively evaluated. Measurements of runtime overhead confirm that the generality of the discussed techniques does not come at a performance expense when compared with existing parametric trace monitoring systems. 1998 ACM Subject Classification: D.1.5 [PROGRAMMING TECHNIQUES]: Object-oriented Programming; D.2.1 [SOFTWARE ENGINEERING]: Requirements/Specifications; D.2.4 [SOFTWARE ENGINEERING]: Software/Program Verification; D.2.5 [SOFTWARE ENGINEERING]: Testing and Debugging—Monitors, Tracing; D.3.1 [PROGRAMMING LANGUAGES]: Formal Definitions and Theory; F.3.1 [LOGICS AND MEANINGS OF PROGRAMS]: Specifying and Verifying and Reasoning about Programs; F.3.2 [LOGICS AND MEANINGS OF PROGRAMS]: Semantics of Programming Languages;